A pseudoconservation law for a time-limited service polling system with structured batch poisson arrivals
نویسندگان
چکیده
منابع مشابه
Time-limited polling systems with batch arrivals and phase-type service times
In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the que...
متن کاملAnalysis of a General Service Nonexhaustive Polling System Using a Heuristic Combination Method and Pseudoconservation Law
This paper is devoted to the analysis of the mean waiting time for a polling system with general service order sequence and nonexhaustive service discipline. We obtain an expression for the mean waiting time in terms of a so-called residual cycle time and derive a pseudoconservation law (PCL) to help improve the accuracy of estimations of the mean waiting time. By multiplying the estimations of...
متن کاملPolling with batch service
This paper considers a batch service polling system. We first study the case in which the server visits the queues cyclically, considering three different service regimes: gated, exhaustive, and globally gated. We subsequently analyze the case (the so called ‘Israeli Queue’) in which the server first visits the queue with the ‘oldest’ customer. In both cases, queue lengths and waiting times are...
متن کاملStaffing a Service System with Non-poisson Nonstationary Arrivals
Motivated by non-Poisson stochastic variability found in service system arrival data, we extend established service system staffing algorithms using the square-root staffing formula to allow for non-Poisson arrival processes. We develop a general model of the non-Poisson nonstationary arrival process that includes as a special case the nonstationary Cox process (a modification of a Poisson proc...
متن کاملOptimal batch service of a polling system under partial information
We consider the optimal scheduling of an infinite.capacity batch server in a N-node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2006
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2005.11.018